International Journal of Advanced Networking and Applications

Sanjay Kumar Pal ¹, Samar Sen Sarma ²

Affiliations
1 Department of Computer Science and Applications, NSHM College of Management & Technology, Kolkata-700053, IN
2 Department of Computer Science & Engineering, University of Calcutta, Kolkata-700009, IN

Abstract

This paper considers generation of Minimal Spanning Trees (MST) of a simple symmetric and connected graph G. In this paper, we propose a new algorithm to find out minimal spanning tree of the graph G based on the weightage of nodes in graph. The time complexity of the problem is in polynomial order with better execution time comparing to the existing algorithms. The goal is to design an algorithm that is simple, elegant, easy to understand and applicable in field of networking design, optimization of network cost, and mobile computing.

Keywords

Graph, Subgraph, Tree, Spanning Tree, Minimal Spanning Tree, Weightage.

Full Text